Optimizing a constrained convex polygonal annulus
نویسندگان
چکیده
منابع مشابه
Optimizing a constrained convex polygonal annulus
In this paper we give solutions to several constrained polygon annulus placement problems for offset and scaled polygons, providing new efficient primitive operations for computational metrology and dimensional tolerancing. Given a convex polygon P and a planar point set S, the goal is to find the thinnest annulus region of P containing S. Depending on the application, there are several ways th...
متن کاملMotion Planning for a Convex Polygon in a Polygonal Environment
We study the motion-planning problem for a convex m-gon P in a planar polygonal environment Q bounded by n edges. We give the rst algorithm that constructs the entire free connguration space (the 3-dimensional space of all free placements of P in Q) in time that is near-quadratic in mn, which is nearly optimal in the worst case. The algorithm is also conceptually relatively simple. Previous sol...
متن کاملOptimizing Motion-Constrained Pathfinding
High-quality motion planning can be quite expensive to perform, yet is critical for many video games. As a result, many approximations are employed to reduce costs. Common approximations include pathfinding on a grid or on a navigation mesh instead of in a real-valued world. As a result, the paths that are found are not immediately appropriate for use, and often require post-processing, such as...
متن کاملConstruction Of the Constrained Delaunay Triangulation Of A Polygonal Domain
A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay triangulation of a polygonal domain. The algorithm simplifies the complicated merging step inherent to divide-and-conquer algorithms for the computation of triangulations. Furthermore, no triangles are computed outside the valid region of the domain. A grid structure accelerat...
متن کاملOptimizing constrained subtrees of trees
Given a tree G = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the "rooted subtree problem", is to find a maximum weight subtree, with a specified root, from a given set of subtrees. The second problem, called "the subtree packing problem", is to find a maximum weight packing of node disjoint subtrees chosen from a given set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2005
ISSN: 1570-8667
DOI: 10.1016/j.jda.2003.12.004